Queens of Code

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Queens ∗

A large scholarship claims that states led by women are less conflictual than states led by men. However, it is theoretically unclear why female leaders would favor more conciliatory war policies. And, it is empirically challenging to identify the effect of female rule, since women may gain power disproportionately during periods of peace. We surmount this challenge by exploiting features of he...

متن کامل

A q-QUEENS PROBLEM III. PARTIAL QUEENS

Parts I and II showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n in which the coefficients are essentially polynomials in q. We explore this function for partial queens, which are pieces like the rook and bishop whose moves are a subset of those of the queen. We compute the five highest-order coe...

متن کامل

A q-QUEENS PROBLEM III. PARTIAL QUEENS

Parts I and II showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n in which the coefficients are essentially polynomials in q. We explore this function for partial queens, which are pieces like the rook and bishop whose moves are a subset of those of the queen. We compute the five highest-order coe...

متن کامل

A q-QUEENS PROBLEM IV. QUEENS, BISHOPS, NIGHTRIDERS (AND ROOKS)

Parts I–III showed that the number of ways to place q nonattacking queens or similar chess pieces on an n × n chessboard is a quasipolynomial function of n whose coefficients are essentially polynomials in q and, for pieces with some of the queen’s moves, proved formulas for these counting quasipolynomials for small numbers of pieces and highorder coefficients of the general counting quasipolyn...

متن کامل

Complexity of n-Queens Completion

The n-Queens problem is to place n chess queens on an n by n chessboard so that no two queens are on the same row, column or diagonal. The n-Queens Completion problem is a variant, dating to 1850, in which some queens are already placed and the solver is asked to place the rest, if possible. We show that n-Queens Completion is both NP-Complete and #P-Complete. A corollary is that any non-attack...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Annals of the History of Computing

سال: 2020

ISSN: 1058-6180,1934-1547

DOI: 10.1109/mahc.2020.2982751